package pathfinding;

import java.util.HashSet;
import java.util.Set;

public class Test {

	public static void main(String[] args) {
		DebugPF db = new DebugPF();
		
		Node n = new Node(0, 5);
		Node m = new Node(9, 5);
		Node n2 = new Node(2, 3);
		Node n3 = new Node(8, 3);
		n.addNeigh(n2);
		n2.addNeigh(n);
		n2.addNeigh(n3);
		n3.addNeigh(n2);
		n3.addNeigh(m);
		m.addNeigh(n3);
		
		boolean t=true, f=false;
		boolean[][] map = new boolean[10][10];
		
		Set<Node> nodes = new HashSet<Node>();
		nodes.add(n);
		nodes.add(m);
		nodes.add(n2);
		nodes.add(n3);
		
		Pathfinding.dijkstras(n, nodes);
		
		db.show(map, nodes);
//		System.out.println(nodes);
		System.out.println(m.path());
	}
}
